package com.agile.leetcode.niuke;

import java.util.Scanner;

/**
 * @Author:ChenZhangKun
 * @Date: 2021/1/6 20:29
 */
public class Demo3 {
    public static void main(String[] args) {
        Scanner scanner=new Scanner(System.in);
        // 输入二维数组
        int a = scanner.nextInt();
        int b=scanner.nextInt();
        // 构建二维数组
        int[][] map=new int[a][b];
        // 输入墙壁个数
        int m=scanner.nextInt();
        for (int i = 0; i < 2*m; i++) {
            // 构建墙壁
            int i1 = scanner.nextInt();
            int i2 = scanner.nextInt();
            // 1表示墙壁
            map[i1][i2]=1;
        }
    }
}
